Bibtex of Graph / Hamiltonian cycle

@article{Martello1983, 
     author = "Martello, Silvano", 
     doi = "10.1145/356022.356030", 
     issn = "00983500", 
     journal = "ACM Transactions on Mathematical Software", 
     link = "http://portal.acm.org/citation.cfm?doid=356022.356030", 
     month = "mar", 
     number = "1", 
     pages = "131--138", 
     title = "Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph", 
     uri = "http://portal.acm.org/citation.cfm?doid=356022.356030", 
     volume = "9", 
     year = "1983", 
}

@article{Wild2008, 
     author = "Wild, Marcel", 
     doi = "10.1016/j.jda.2007.01.005", 
     issn = "15708667", 
     journal = "Journal of Discrete Algorithms", 
     keyword = "Generating all Hamiltonian cycles,Generating all chordless cycles,Generating all cycles", 
     link = "http://www.sciencedirect.com/science/article/pii/S1570866707000020 http://linkinghub.elsevier.com/retrieve/pii/S1570866707000020", 
     month = "mar", 
     number = "1", 
     pages = "93--102", 
     title = "Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion", 
     uri = "http://www.sciencedirect.com/science/article/pii/S1570866707000020", 
     volume = "6", 
     year = "2008", 
}

@article{Yau1967, 
     author = "Yau, S.", 
     doi = "10.1109/TCT.1967.1082662", 
     issn = "0018-9324", 
     journal = "IEEE Transactions on Circuit Theory", 
     link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082662", 
     month = "mar", 
     number = "1", 
     pages = "79--81", 
     title = "Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related Problems", 
     uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082662", 
     volume = "14", 
     year = "1967", 
}